Dynamic Maintenance of Majority Information in Constant Time per Update
نویسندگان
چکیده
منابع مشابه
Dynamic Maintenance of Majority Information in Constant Time per Update
We show how to maintain information about the existence of a majority colour in a set of elements under insertion and deletion of single elements using O(1) time and at most 4 equality tests on colours per update. No ordering information is used.
متن کاملSolving online feasibility problem in constant amortized time per update
We present a deterministic algorithm for solving the two and three-dimensional online feasibility problem. Insertion of a new constraint is processed in constant amortized time. Our method is adapted from the offline linear deterministic Megiddo algorithm for linear programming. As in his prune and search technique, our method and its time bound extend to higher dimensions but involve the same ...
متن کاملRange Majority in Constant Time and Linear Space
Given an array A of size n, we consider the problem of answering range majority queries: given a query range [i..j] where 1 ≤ i ≤ j ≤ n, return the majority element of the subarray A[i..j] if it exists. We describe a linear space data structure that answers range majority queries in constant time. We further generalize this problem by defining range α-majority queries: given a query range [i..j...
متن کاملConstant Time per Edge Is Optimal in Rooted Tree Networks
We analyze how the expected packet delay in rooted tree networks is aaected by the distribution of time needed for a packet to cross an edge using stochastic comparison methods. Our result generalizes previously known results that the delay when the crossing time is exponentially distributed yields an upper bound for the expected delay when the crossing time is constant on this class of of netw...
متن کاملParallel On-Line Parsing in Constant Time per Word
Sikkel, K., Parallel on-line parsing in constant time per word, Theoretical Computer Science 120 (1993) 303-310. An on-line parser processes each word as soon as it is typed by the user, without waiting for the end of the sentence. Thus, in an interactive system, a sentence will be parsed almost immediately after the last word has been presented. The complexity of an on-line parser is determine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1995
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v2i45.19946